منابع مشابه
Axiomatizations of Banzhaf permission values for games with a permission structure
In games with a permission structure it is assumed that players in a cooperative transferable utility game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. We provide axiomatic characterizations of Banzhaf permission values being solutions that are obtained by applying the Banzhaf value to modified TU-ga...
متن کاملThe Average Tree Permission Value for Games with a Permission Tree
In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we consider such sets of feasible coalitions that follow from a permission structure on the set of players...
متن کاملGames with fuzzy permission structure: A conjunctive approach
A cooperative game consists of a set of players and a characteristic function which determines the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate, regardless of the actions that the other players take. A permission structure over the set of players describes a hierarchical organization where there are players who need permission from certain ...
متن کاملSimple plurality versus plurality runoff with privately informed voters
This paper compares two voting methods commonly used in presidential elections: simple plurality voting and plurality runoff. In a situation in which a group of voters have common interests but do not agree on which candidate to support due to private information, information aggregation requires them to split their support between their favorite candidates. However, if a group of voters split ...
متن کاملSimple games on closure spaces
Let N be a ...nite set. By a closure space we mean the family of the closed sets of a closure operator on 2 satisfying the additional condition ; = ;. A simple game on a closure space L is a function v : L ! f0; 1g such that v(;) = 0 and v (N) = 1. We assume simple games are monotonic. The coalitions are the closed sets of L and the players are the elements i 2 N . We will give results concerni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1999
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.42.286